منابع مشابه
Small Gaps between Primes or Almost Primes
Let pn denote the nth prime. Goldston, Pintz, and Yıldırım recently proved that lim inf n→∞ (pn+1 − pn) log pn = 0. We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of exactly two distinct primes. We prove that lim inf n→∞ (qn+1 − qn) ≤ 26. If an appropriate generalization of ...
متن کاملSurfaces via Almost - Primes
Based on the result on derived categories on K3 surfaces due to Mukai and Orlov and the result concerning almost-prime numbers due to Iwaniec, we remark the following facts: (1) For any given positive integer N , there are N (mutually non-isomorphic) projective complex K3 surfaces such that their Picard groups are not isomorphic but their transcendental lattices are Hodge isometric, or equivale...
متن کاملNullspace-primes and Fibonacci Polynomials
A nonzero m x n (0, 1)-matrix A is called a nullspace matrix If each entry (/', j) of A has an even number of l's in the set of entries consisting of (/, j) and its rectilinear neighbors. It is called a nullspace matrix since the existence of an m x n nullspace matrix implies the closed neighborhood matrix of the mxn grid graph Is singular over GF(2). By closed neighborhood matrix, we mean the ...
متن کاملPower Totients with Almost Primes
A natural number n is called a k-almost prime if n has precisely k prime factors, counted with multiplicity. For any fixed k > 2, let Fk.X/ be the number of k-th powers m 6 X such that !.n/ D m for some squarefree k-almost prime n, where !. ! / is the Euler function. We show that the lower bound Fk.X/ " X=.log X/ holds, where the implied constant is absolute and the lower bound is uniform over ...
متن کاملTotally Ramified Primes and Eisenstein Polynomials
is Eisenstein at a prime p when each coefficient ci is divisible by p and the constant term c0 is not divisible by p 2. Such polynomials are irreducible in Q[T ], and this Eisenstein criterion for irreducibility is the way nearly everyone first meets Eisenstein polynomials. Here, we will show Eisenstein polynomials are closely related to total ramification of primes in number fields. Let K be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1965
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-11-1-35-56